Reset machines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets

We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.

متن کامل

Reset control systems: stabilization by nearly-periodic reset

In this paper the class of linear impulsive systems is considered. These systems are those with a continuous linear dynamics for all time, except at a sequence of instants. When such a discrete time occurs, the state undergoes a jump, or more precisely follows a discrete linear dynamics. The sequence of time instants, when a discrete dynamics occurs, is nearlyperiodic only, i.e. it is distant f...

متن کامل

Tuning rules for a reset PI compensator with variable reset

Abstract: The PI+CI compensator is a simple reset compensator, its base system is a PI, which has been shown to be effective in a number of practical applications. One fundamental parameter to be tuned is the reset ratio; for lag dominant systems or systems with integrators it is known to give good results overcoming PI compensation. In this work, a systematic method for the tuning of a variabl...

متن کامل

Multitolerance in Distributed Reset

A reset of a distributed system is safe if it does not complete “preAbstract-1 maturely,” i.e., without having reset some process in the system. Safe resets are possible in the presence of certain faults, such as process failstops and repairs, but are not always possible in the presence of more general faults, such as arbitrary transients. In this paper, we design a bounded-memory distributed-r...

متن کامل

Reset Anish ARORA

We design a reset subsystem that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary. Our design is layered, and comprises three main components: a leader election, a spanning tree construction, and a diiusing computation. Each of these components is self-stabilizing in the following sense. If the coordination between the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1979

ISSN: 0022-0000

DOI: 10.1016/0022-0000(79)90004-7